k -Splittable delay constrained routing problem: A branch-and-price approach
نویسندگان
چکیده
منابع مشابه
A Branch and Price algorithm for the k-splittable maximum flow problem
The Maximum Flow Problem with flow width constraints is a NP-hard problem. Two models are proposed: the first model is a compact node-arc model using two flow conservation blocks per path. For each path, one block defines the path while the other one send the right amount of flow on it. The second model is an extended arc-path model. It is obtained from the first model after a Dantzig-Wolfe ref...
متن کاملComparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem
Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or r...
متن کاملA GRASP approach for the delay-constrained multicast routing problem
The rapid development of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained minimum Steiner tree problem in graphs as the underpinning mathematical model is a wellknown NP-complete problem. In this paper we investigate a GRASP (Greedy Randomized Adaptive Search Procedure) approach with VNS (Variable Neighb...
متن کاملA branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
We consider the Commodity constrained Split Delivery Vehicle Routing Problem (CSDVRP), a routing problem where customers may request multiple commodities. The vehicles can deliver any set of commodities, and multiple visits to a customer are allowed only if the customer requests multiple commodities. If the customer is visited more than once, the different vehicles will deliver different sets o...
متن کاملA Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem
We study a multi-criteria variant of the problem of routing hazardous material on a geographical area subdivided in regions. The two objective functions are given by a generally defined routing cost and a risk equity equal to the maximum, over each region, of the risk perceived within a region. This is a multicommodity flow problem where integer variables are used to define the number of trucks...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2009
ISSN: 0028-3045
DOI: 10.1002/net.20311